منابع مشابه
Game brush number
We study a two-person game based on the well-studied brushing process on graphs. Players Min and Max alternately place brushes on the vertices of a graph. When a vertex accumulates at least as many brushes as its degree, it sends one brush to each neighbor and is removed from the graph; this may in turn induce the removal of other vertices. The game ends once all vertices have been removed. Min...
متن کاملNumber game
CLARIN (Common Language Resources and Technology Infrastructure) is regarded as one of the most important European research infrastructures, offering and promoting a wide array of useful services for (digital) research in linguistics and humanities. However, the assessment of the users for its core technical development has been highly limited, therefore, it is unclear if the community is thoro...
متن کاملA Number-Guessing Game
On the TV show “The Price Is Right,” a player tries to win a new car by guessing its price. The price consists of a known number of digits (usually 5). Possibilities (hints) for each digit are revealed to the player. If the player fails to guess at least one correct digit in its correct place during a turn, the player loses. A player who eventually guesses all digits correctly wins the car. For...
متن کاملThe incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with maximum degree ∆, the upper bound 2∆ + 4k − 2 for the incidence game chromatic number is given. If ∆ ≥ 5k, we improve this bound to the value 2∆ + 3k − 1. We also determine the exact incidence game chromatic number of...
متن کاملGame matching number of graphs
We study a competitive optimization version of α(G), the maximum size of a matching in a graph G. Players alternate adding edges of G to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted α g(G) and α̂ ′ g(G), respectively. We show that al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.02.011